Orthogonal segment stabbing
نویسندگان
چکیده
We study a class of geometric stabbing/covering problems for sets of line segments, rays, and lines in the plane. While we demonstrate that the problems on sets of horizontal/vertical line segments are NP-complete, we show that versions involving (parallel) rays or lines are polynomially solvable.
منابع مشابه
Computing conforming partitions of orthogonal polygons with minimum stabbing number
Let P be an orthogonal polygon with n vertices. A partition of P into rectangles is called conforming if it results from cutting P along a set of interior-disjoint line segments, each having both endpoints on the boundary of P . The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any orthogonal line segment inside P . In this paper, we consider...
متن کاملErratum to: Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number
In this note, we report an error in our paper “Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number” [2]. Given an orthogonal polygon P and a partition of P into rectangles, the stabbing number of the partition is defined as the maximum number of rectangles stabbed by any orthogonal line segment inside P . Abam et al. [1] introduced the problem of finding a partition of P i...
متن کاملI/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries
We develop several linear or near-linear space and I/Oefficient dynamic data structures for orthogonal range-max queries and stabbing-max queries. Given a set of N weighted points in R, the rangemax problem asks for the maximum-weight point in a query hyperrectangle. In the dual stabbing-max problem, we are given N weighted hyper-rectangles, and we wish to find the maximum-weight rectangle cont...
متن کاملNew Results on Stabbing Segments with a Polygon
We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed by P if P stabs every element of S. Given a segment set S, we study the problem of finding a simple polygon P stabbing S in a way that some measure of P (such as area or pe...
متن کاملStabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R 2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without reflection), is called free if B does not intersect the interior of any polygon in O at this placement. A placement z of B is called critical if B forms three “distinct” contacts with O at z. Let φ(B,O) be the number of f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 30 شماره
صفحات -
تاریخ انتشار 2005